On splitting recursive sets
نویسندگان
چکیده
منابع مشابه
Splitting NP-Complete Sets
We show that a set is m-autoreducible if and only if it is m-mitotic. This solves a long standing open question in a surprising way. As a consequence of this unconditional result and recent work by Glaßer et al., complete sets for all of the following complexity classes are m-mitotic: NP, coNP, ⊕P, PSPACE, and NEXP, as well as all levels of PH, MODPH, and the Boolean hierarchy over NP. In the c...
متن کاملSplitting and Density for the Recursive Sets of a Fixed Time Complexity
l. It¡tRonucr¡oN There ha.s 5ee¡r a persisterrl, iut,uitio¡r Ùhaü tt¡e coutputstioual cotnplexityofasetAofstringsisrelatedtothestrucüureofthedistributio¡¡of the elements of A. For exanlple, Mahaney's [Mal solution to tl¡e Bern¡an' Hartmanis conjecture or Martin's [Marl characterization of the T\rring degreesofbhemaximalrecursivelyenu¡nerablesetsgrewouüofthedesireto test this intuition. Although...
متن کاملCovering the Recursive Sets
We give solutions to two of the questions in a paper by Brendle, BrookeTaylor, Ng and Nies. Our examples derive from a 2014 construction by Khan and Miller as well as new direct constructions using martingales. At the same time, we introduce the concept of i.o. subuniformity and relate this concept to recursive measure theory. We prove that there are classes closed downwards under Turing reduci...
متن کاملSplitting the recursive least-squares algorithm
Exponentially weighted recursive least-squares (RLS) algorithms are commonly used for fast adaptation. In many cases the input signals are continuous-time. Either a fully analog implementation of the RLS algorithm is applied or the input data are sampled by analog-to-digital (AD) converters to be processed digitally. Although a digital realization is usually the preferred choice, it becomes unf...
متن کاملRecursive Cellular Automata Invariant Sets
A bstract. Subshift s of bi-infinit e words give rise to languages in a natural way. Three invariant subshifts associated wit h cellular automata dynamics are considered : the periodic set, non-wandering set , and limit set . Exam ples have been given (see [8,12]) of cellular automata whose invarian t sets give rise to nonrecursive languages. In this pap er , examples are given of cellular aut ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1978
ISSN: 0022-0000
DOI: 10.1016/0022-0000(78)90034-x